ROLLER COASTER RETINOPATHY
نویسندگان
چکیده
منابع مشابه
Roller coaster-induced barotrauma.
We present the case of a 24-year-old male who presented to the otolaryngology clinic for otalgia and aural fullness after riding a roller coaster. We present his clinical course and outcome and briefly discuss the mechanism of injury and otologic barotrauma. Roller coasters have been reported as the cause of many different types of injuries, but this is the first reported case of otologic barot...
متن کاملThe Roller-Coaster Conjecture Revisited
A graph is well-covered if all its maximal independent sets are of the same cardinality [25]. If G is a well-covered graph, has at least two vertices, and G − v is well-covered for every vertex v, then G is a 1-well-covered graph [26]. We call G a λ-quasi-regularizable graph if λ · |S| ≤ |N (S)| for every independent set S of G. The independence polynomial I(G;x) is the generating function of i...
متن کاملCardiovascular Response to a Modern Roller Coaster RideCardiovascular Response to a Modern Roller Coaster Ride.
cal Investigator Training Program, which supports his salary and provides formal training in various aspects of clinical research. This program was set up as a joint venture of the Harvard-MIT Division of Health Sciences and Technologies and the Beth Israel Deaconess Medical Center, supported by unrestricted educational grants from Pfizer and Merck Inc. During 2006, he was funded by the Fundaci...
متن کاملThe great cosmic roller-coaster ride.
You might not think that cosmologists could feel claustrophobic in a universe that is 46 billion light-years in radius and filled with sextillions of stars. But one of the emerging themes of 21stcentury cosmology is that the known universe, the sum of all we can see, may just be a tiny region in the full extent of space. Various types of parallel universes that make up a grand “multiverse” ofte...
متن کاملMaximal-clique partitions and the Roller Coaster Conjecture
A graph G is well-covered if every maximal independent set has the same cardinality q. Let ik(G) denote the number of independent sets of cardinality k in G. Brown, Dilcher, and Nowakowski conjectured that the independence sequence (i0(G), i1(G), . . . , iq(G)) was unimodal for any well-covered graph G with independence number q. Michael and Traves disproved this conjecture. Instead they posite...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RETINAL Cases & Brief Reports
سال: 2016
ISSN: 1935-1089
DOI: 10.1097/icb.0000000000000245